Rational Elimination of DL-Lite TBox Axioms
نویسندگان
چکیده
An essential task in managing description logic (DL) ontologies is the elimination of problematic axioms. Such elimination is formalised as the operation of contraction in belief change. In this paper, we investigate contraction over DL-LiteR TBoxes. In belief change, a well known approach for defining contraction is via epistemic entrenchments which are preference orderings over formulas. The approach however is not applicable in DL-LiteR as classic belief change assumes an underlying logic that is different from DL-LiteR. Thus we reformulate the epistemic entrenchment approach to make it applicable to DL-LiteR. We then provide instantiation for the reformulated approach.
منابع مشابه
Instance-Driven Ontology Evolution in DL-Lite
The development and maintenance of large and complex ontologies are often time-consuming and error-prone. Thus, automated ontology learning and evolution have attracted intensive research interest. In data-centric applications where ontologies are designed from the data or automatically learnt from it, when new data instances are added that contradict the ontology, it is often desirable to incr...
متن کاملDL-Lite with Temporalised Concepts, Rigid Axioms and Roles
We investigate the temporal extension of the description logic DL-Lite bool with the until operator on concepts, rigid (time-independent) and local (time-dependent) roles, and rigid TBox axioms. Using an embedding into the one-variable fragment of first-order temporal logic and the quasimodel technique, we prove that (i) the satisfiability problem for the resulting logic is PSpace-complete, and...
متن کاملA DL-Lite Ontology Revision Based on An Alternative Semantic Characterisation
Ontology engineering and maintenance require (semi-)automated ontology change operations. Intensive research has been conducted on TBox and ABox changes in description logics (DLs), and various change operators have been proposed in the literature. Existing operators largely fall into two categories: syntax-based and model-based. While each approach has its advantages and disadvantages, an impo...
متن کاملForgetting for Knowledge Bases in DL-Litebool
We address the problem of term elimination in DLLite ontologies by adopting techniques from classical forgetting theory. Specifically, we generalize our previous results on forgetting in DL-Litecore TBox to forgetting in DL-Litebool KBs. We also introduce query-based forgetting, a parameterized definition of forgetting, which provides a unifying framework for defining and comparing different de...
متن کاملA Distance-Based Paraconsistent Semantics for DL-Lite
DL-Lite is an important family of description logics. Recently, there is an increasing interest in handling inconsistency in DL-Lite as the constraint imposed by a TBox can be easily violated by assertions in ABox in DL-Lite. In this paper, we present a distance-based paraconsistent semantics based on the notion of feature in DL-Lite, which provides a novel way to rationally draw meaningful con...
متن کامل